Elastic matching in linear time and constant space
نویسندگان
چکیده
Dynamic time warping (DTW) is well known as an effective method for model-based symbol recognition. Unfortunately, its complexity is quadratic in the number of points present in the symbols to be matched. In this paper, we propose a greedy approximate solution to Tappert’s dynamic program formulation of DTW, and show empirically that it performs as well as the exact solution while requiring only linear time to compute.
منابع مشابه
Efficient Pattern Matching in Elastic-Degenerate Strings
In this paper, we extend the notion of gapped strings to elastic-degenerate strings. An elastic-degenerate string can been seen as an ordered collection of k > 1 seeds (substrings/subpatterns) interleaved by elastic-degenerate symbols such that each elastic-degenerate symbol corresponds to a set of two or more variable length strings. Here, we present an algorithm for solving the pattern matchi...
متن کاملSaving Comparisons in the Crochemore-Perrin String Matching Algorithm
Crochemore and Perrin discovered an elegant linear-time constant-space string matching algorithm that makes at most 2n ?m symbol comparison. This paper shows how to modify their algorithm to use fewer comparisons. Given any xed > 0, the modiied algorithm takes linear time, uses constant space and makes at most n + b 1+ 2 (n ? m)c comparisons. If O(log m) space is available, then the algorithm m...
متن کاملTime Warp Edit Distance
This technical report details a family of time warp distances on the set of discrete time series. This family is constructed as an editing distance whose elementary operations apply on linear segments. A specific parameter allows controlling the stiffness of the elastic matching. It is well suited for the processing of event data for which each data sample is associated with a timestamp, not ne...
متن کاملConstant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling
A new string-matching algorithm working in constant space and linear time is presented. It is based on a powerful idea of sampling, originally introduced in parallel computations. The algorithm uses a sample S which consists of two positions inside the pattern P. First the positions of the sample S are tested against the corresponding positions of the text T, then a version of Knuth-Morris-Prat...
متن کاملBoundary Value Problems in Generalized Thermodiffusive Elastic Medium
In the present study, the boundary value problems in generalized thermodiffusive elastic medium has been investigated as a result of inclined load. The inclined load is assumed to be a linear combination of normal load and tangential load. Laplace transform with respect to time variable and Fourier transform with respect to space variable are applied to solve the problem. As an application of t...
متن کامل